S/MIMO MC-CDMA Heuristic Multiuser Detectors Based on Single-Objective Optimization

This paper analyzes the complexity-performance trade-off of several heuristic near-optimum multiuser detection (MuD) approaches applied to the uplink of synchronous single/multiple-input multiple-output multicarrier code division multiple access (S/MIMO MC-CDMA) systems. Genetic algorithm (GA), short term tabu search (STTS) and reactive tabu search (RTS), simulated annealing (SA), particle swarm optimization (PSO), and 1-opt local search (1-LS) heuristic multiuser detection algorithms (Heur-MuDs) are analyzed in details, using a single-objective antenna-diversity-aided optimization approach. Monte-Carlo simulations show that, after convergence, the performances reached by all near-optimum Heur-MuDs are similar. However, the computational complexities may differ substantially, depending on the system operation conditions. Their complexities are carefully analyzed in order to obtain a general complexity-performance framework comparison and to show that unitary Hamming distance search MuD (uH-ds) approaches (1-LS, SA, RTS and STTS) reach the best convergence rates, and among them, the 1-LSPart of this paper was presented at ISSSTA’08 The 10th International Symposium on Spread Spectrum Techniques and Applications, Bologna, Italy, Aug. 2008 T. Abrão Dept. of Electrical Engineering; State University of Londrina, PR, 86051-990, Brazil Tel.: +55-43-3371-4789 Fax: +55-43-3371-4790 E-mail: [email protected] L. D. de Oliveira, F. Ciriaco, B. A. Angélico, P. J. E. Jeszensky Dept. of Telecomm. and Control Engineering; Escola Politécnica of the University of São Paulo; 05508-900, Brazil E-mail: [leonardo, fciriaco, angelico, pjj]@lcs.poli.usp.br F. Casadevall Dept. of Signal Theory and Communication (TSC); Universitat Politècnica de Catalunya (UPC); C. Jordi Girona 1-3, Campus Nord, Edificio D4, 08034 Barcelona, Spain E-mail: [email protected]